Higher-Order Logic Programming

A Fast and Self-Repairing Genetic Programming Designer for Logic Circuits

Usually, important parameters in the design and implementation of combinational logic circuits are the number of gates, transistors, and the levels used in the design of the circuit. In this regard, various evolutionary paradigms with different competency have recently been introduced. However, while being advantageous, evolutionary paradigms also have some limitations including: a) lack of con...

Higher-order Aspects of Logic Programming

Are higher-order extensions to logic programming needed? We answer this question in the negative by showing that higher-order features are already available in pure logic programming. It is demonstrated that higher-order lambda calculus-based languages can be compositionally embedded in logic programming languages preserving their semantics and abstraction facilities. Further, we show that such...

Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation

Extensional higher-order logic programming has been introduced as a generalization of classical logic programming. An important characteristic of this paradigm is that it preserves all the well-known properties of traditional logic programming. In this paper we consider the semantics of negation in the context of the new paradigm. Using some recent results from non-monotonic fixed-point theory,...

A Extensional Higher-Order Logic Programming

The two most prominent declarative paradigms, namely logic and functional programming, differ radically in an important aspect: logic programming is traditionally firstorder while functional programming encourages and promotes the use of higher-order functions and constructs. This difference can be partially explained by the fact that higher-order logic fails in terms of vital properties such a...

Higher-order Logic Programming Higher-order Logic Programming Y Contents 1 Introduction 3 2 Motivating a Higher-order Extension to Horn Clauses 5 3 a Higher-order Logic 12

A Call-by-Need Strategy for Higher-Order Functional-Logic Programming

We present an approach to truely higher order functional logic programming based on higher order narrowing Roughly speaking we model a higher order functional core language by higher order rewriting and extend it by logic variables For the integration of logic programs conditional rules are supported For solving goals in this framework we present a complete calcu lus for higher order conditiona...